Symbolic Dynamic Programming
نویسنده
چکیده
A symbolic dynamic programming approach for solving first-order Markov decision processes within the situation calculus is presented. As an alternative specification language for dynamic worlds the fluent calculus is chosen and the fluent calculus formalization of the symbolic dynamic programming approach is provided. The major constructs of Markov decision processes such as the optimal value function and the policy are logically represented. The technique produces a set of first-order formulae that minimally partitions the state space. Consequently, the symbolic dynamic programming algorithm presented here does not require neither state nor action space enumeration, thereby solving the drawback of classical dynamic programming methods.
منابع مشابه
Symbolic Dynamic Programming within the Fluent Calculus
A symbolic dynamic programming approach for modelling first-order Markov decision processes within the fluent calculus is given. Based on an idea initially presented in [3], the major components of Markov decision processes such as the optimal value function and a policy are logically represented. The technique produces a set of first-order formulae with equality that minimally partitions the s...
متن کاملSymbolic Prediction of Dynamic Memory Requirements
This work presents a technique to compute symbolic nonlinear approximations of the amount of dynamic memory required to safely run a method in (Java-like) imperative programs. We do that for scoped-memory management where objects are organized in regions associated with the lifetime of methods. Our approach resorts to a symbolic non-linear optimization problem which is solved using Bernstein ba...
متن کاملSymbolic Generalization for On-line Planning
Symbolic representations have been used successfully in off-line planning algorithms for Markov decision processes. We show that they can also improve the performance of online planners. In addition to reducing computation time, symbolic generalization can reduce the amount of costly real-world interactions required for convergence. We introduce Symbolic Real-Time Dynamic Programming (or sRTDP)...
متن کاملSymbolic Dynamic Programming
Decision-theoretic planning aims at constructing a policy for acting in an uncertain environment that maximizes an agent’s expected utility along a sequence of steps that solve a goal. For this task, Markov decision processes (MDPs) have become the standard model. However, classical dynamic programming algorithms for solving MDPs require explicit state and action enumeration, which is often imp...
متن کاملA Study of Genetic Programming Variable Population Size for Dynamic Optimization Problems
A new model of Genetic Programming with variable size population is presented in this paper and applied to the reconstruction of target functions in dynamic environments (i.e. problems where target functions change with time). The suitability of this model is tested on a set of benchmarks based on some well known symbolic regression problems. Experimental results confirm that our variable size ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002